Local Moves on Spatial Graphs and Finite Type Invariants

نویسندگان

  • Kouki Taniyama
  • Akira Yasuhara
  • H. Murakami
چکیده

We define Ak-moves for embeddings of a finite graph into the 3-sphere for each natural number k. Let Ak-equivalence denote an equivalence relation generated by Ak-moves and ambient isotopy. Ak-equivalence implies Ak−1-equivalence. Let F be an Ak−1-equivalence class of the embeddings of a finite graph into the 3-sphere. Let G be the quotient set of F under Ak-equivalence. We show that the set G forms an abelian group under a certain geometric operation. We define finite type invariants on F of order (n; k). And we show that if any finite type invariant of order (1; k) takes the same value on two elements of F , then they are Ak-equivalent. Ak-move is a generalization of Ck-move defined by K. Habiro. Habiro showed that two oriented knots are the same up to Ck-move and ambient isotopy if and only if any Vassiliev invariant of order ≤ k − 1 takes the same value on them. The ‘if ’ part does not hold for two-component links. Our result gives a sufficient condition for spatial graphs to be Ck-equivalent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Type Knot Invariants Based on the Band-pass and Doubled Delta Moves

We study generalizations of finite-type knot invariants obtained by replacing the crossing change in the Vassiliev skein relation by some other local move. There are several ways of formalizing the notion of a local move. Representing knots as closed braids, one can define local moves as modifications by elements of some subgroup G of the pure braid group P∞ on an infinite number of strands. We...

متن کامل

Knot Theory for Self-indexed Graphs

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs resulting from link diagrams have an additional structure, an integral flow. We call a self-indexed graph with integral flow a comte. The analogy with links...

متن کامل

Relative non-Normal Graphs of a Subgroup of Finite Groups

Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...

متن کامل

Characterization of Finite Type String Link

In this paper, we give a complete set of finite type string link invariants of degree < 5. In addition to Milnor invariants, these include several string link invariants constructed by evaluating knot invariants on certain closure of (cabled) string links. We show that finite type invariants classify string links up to Ck-moves for k ≤ 5, which proves, at low degree, a conjecture due to Goussar...

متن کامل

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999